Bounds for Optimal Coverings
نویسندگان
چکیده
منابع مشابه
Bounds for Optimal Coverings
We give bounds for optimal coverings of finite sets by elements of regular families of subsets, and show that both upper and lower bounds are asymptotically sharp for some families of examples.
متن کاملOptimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means
We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)
متن کاملOptimal OFDM system design through optimal sphere coverings
ABSTRACT Standard OFDM systems are associated with a rectangular grid in the time-frequency plane. However such a setup is in general not optimal for pulse shaping OFDM systems for doubly dispersive channels. We introduce lattice-OFDM systems (LOFDM), which are OFDM systems constructed with respect to general lattices in the time-frequency plane. We show how to design optimal pulse shapes for L...
متن کاملNear-optimal Regret Bounds for Reinforcement Learning Near-optimal Regret Bounds for Reinforcement Learning
This technical report is an extended version of [1]. For undiscounted reinforcement learning in Markov decision processes (MDPs) we consider the total regret of a learning algorithm with respect to an optimal policy. In order to describe the transition structure of an MDP we propose a new parameter: An MDP has diameter D if for any pair of states s, s there is a policy which moves from s to s i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2001
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00225-2